A Feature-Based Learning Method for Theorem Proving
نویسنده
چکیده
Automated reasoning or theorem proving essentially amounts to solving search problems. Despite significant progress in recent years theorem provers still have many shortcomings. The use of machine-learning techniques is acknowledged as promising, but difficult to apply in the area of theorem proving. We propose here to learn search-guiding heuristics by employing features in a simple, yet effective manner. Features are used to adapt a heuristic to a solved source problem. The adapted heuristic can then be utilized profitably for solving related target problems. Experiments have demonstrated that the approach not only allows for significant speed-ups, but also makes it possible to prove problems that were out of reach before.
منابع مشابه
A short introduction to two approaches in formal verification of security protocols: model checking and theorem proving
In this paper, we shortly review two formal approaches in verification of security protocols; model checking and theorem proving. Model checking is based on studying the behavior of protocols via generating all different behaviors of a protocol and checking whether the desired goals are satisfied in all instances or not. We investigate Scyther operational semantics as n example of this...
متن کاملFakult at F Ur Informatik Der Technischen Universitt at M Unchen Lehrstuhl Viii Forschungsgruppe Automated Reasoning Feature-based Learning of Search-guiding Heuristics for Theorem Proving Feature-based Learning of Search-guiding Heuristics for Theorem Proving
b b b b b b b b b b b b b b b b b b b Abstract Automated reasoning or theorem proving essentially amounts to solving search problems. Despite signiicant progress in recent years theorem provers still have many shortcomings. The use of machine-learning techniques is acknowledged as promising, but diicult to apply in the area of theorem proving. We propose here to learn search-guiding heuristics ...
متن کاملFeature-Based Learning of Search-Guiding Heuristics for Theorem Proving
b b b b b b b b b b b b b b b b b b b Abstract Automated reasoning or theorem proving essentially amounts to solving search problems. Despite signiicant progress in recent years theorem provers still have many shortcomings. The use of machine-learning techniques is acknowledged as promising, but diicult to apply in the area of theorem proving. We propose here to learn search-guiding heuristics ...
متن کاملCombining Shallow and Deep NLP Methods for Recognizing Textual Entailment
We combine two methods to tackle the textual entailment challenge: a shallow method based on word overlap and a deep method using theorem proving techniques. We use a machine learning technique to combine features derived from both methods. We submitted two runs, one using all features, yielding an accuracy of 0.5625, and one using only the shallow feature, with an accuracy of 0.5550. Our metho...
متن کاملA fixed point method for proving the stability of ring $(alpha, beta, gamma)$-derivations in $2$-Banach algebras
In this paper, we first present the new concept of $2$-normed algebra. We investigate the structure of this algebra and give some examples. Then we apply a fixed point theorem to prove the stability and hyperstability of $(alpha, beta, gamma)$-derivations in $2$-Banach algebras.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1998